adaptive sort造句

• Another example is adaptive sort, whose behaviour changes upon the presortedness of its input.
• Note that comparison sorts may run faster on some lists; many adaptive sorts such as insertion sort run in O ( " n " ) time on an already-sorted or nearly-sorted list.
• When using a splay tree as the binary search tree, the resulting algorithm ( called splaysort ) has the additional property that it is an adaptive sort, meaning that its running time is faster than for inputs that are nearly sorted.